Weighted relaxation for multigrid reduction in time
نویسندگان
چکیده
منابع مشابه
Multigrid Waveform Relaxation for the Time-Fractional Heat Equation
In this work, we propose an efficient and robust multigrid method for solving the time-fractional heat equation. Due to the nonlocal property of fractional differential operators, numerical methods usually generate systems of equations for which the coefficient matrix is dense. Therefore, the design of efficient solvers for the numerical simulation of these problems is a difficult task. We deve...
متن کاملTwo-Level Convergence Theory for Multigrid Reduction in Time (MGRIT)
Abstract. In this paper we develop a two-grid convergence theory for the parallel-in-time scheme known as multigrid reduction in time (MGRIT), as it is implemented in the open-source XBraid package [25]. MGRIT is a scalable and multi-level approach to parallel-in-time simulations that non-intrusively uses existing time-stepping schemes, and that in a specific two-level setting is equivalent to ...
متن کاملLocal Fourier Analysis of Space-Time Relaxation and Multigrid Schemes
We consider numerical methods for generalized diffusion equations that are motivated by the transport problems arising in electron beam radiation therapy planning. While Monte Carlo methods are typically used for simulations of the forward-peaked scattering behavior of electron beams, rough calculations suggest that grid-based discretizations can provide more efficient simulations if the discre...
متن کاملRelaxation Schemes for Chebyshev Spectral Multigrid Methods
SUMMARY Two relaxation schemes for Chebyshev spectral multigrid methods are presented for elliptic equations with Dirichlet boundary conditions. The rst scheme is a pointwise-preconditioned Richardson relaxation scheme and the second is a line relaxation scheme. The line relaxation scheme provides an eecient and relatively simple approach for solving two-dimensional spectral equations. Numerica...
متن کاملCompatible Relaxation and Coarsening in Algebraic Multigrid
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra With Applications
سال: 2022
ISSN: ['1070-5325', '1099-1506']
DOI: https://doi.org/10.1002/nla.2465